A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words
نویسندگان
چکیده
A quantile summary is a data structure that approximates to ε error the order statistics of a much larger underlying dataset. In this paper we develop a randomized online quantile summary for the cash register data input model and comparison data domain model that uses O((1/ε) log(1/ε)) words of memory. This improves upon the previous best upper bound of O((1/ε) log3/2(1/ε)) by Agarwal et al. (PODS 2012). Further, by a lower bound of Hung and Ting (FAW 2010) no deterministic summary for the comparison model can outperform our randomized summary in terms of space complexity. Lastly, our summary has the nice property that O((1/ε) log(1/ε)) words suffice to ensure that the success probability is at least 1− exp(−poly(1/ε)). ACM Classification: F.2.2, E.1, F.1.2 AMS Classification: 68W20, 68W25, 68W27, 68P05
منابع مشابه
A randomized online quantile summary in $O(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})$ words
A quantile summary is a data structure that approximates to ε-relative error the order statistics of a much larger underlying dataset. In this paper we develop a randomized online quantile summary for the cash register data input model and comparison data domain model that uses O( 1 ε log 1 ε ) words of memory. This improves upon the previous best upper bound of O( 1 ε log 1 ε ) by Agarwal et. ...
متن کاملA randomized online quantile summary in O(1/ɛ log 1/ɛ) words
A quantile summary is a data structure that approximates to ε-relative error the order statistics of a much larger underlying dataset. In this paper we develop a randomized online quantile summary for the cash register data input model and comparison data domain model that uses O( ε log 1 ε ) words of memory. This improves upon the previous best upper bound of O( ε log 3/2 1 ε ) by Agarwal et a...
متن کاملA Randomized Online Quantile Summary in O(1
A quantile summary is a data structure that approximates to ε-relative error the order statistics of a much larger underlying dataset. In this paper we develop a randomized online quantile summary for the cash register data input model and comparison data domain model that uses O( ε log 1 ε ) words of memory. This improves upon the previous best upper bound of O( ε log 3/2 1 ε ) by Agarwal et a...
متن کاملConstant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs
We give a $(1+\epsilon)$-approximate distance oracle with $O(1)$ query time for an undirected planar graph $G$ with $n$ vertices and non-negative edge lengths. For $\epsilon>0$ and any two vertices $u$ and $v$ in $G$, our oracle gives a distance $\tilde{d}(u,v)$ with stretch $(1+\epsilon)$ in $O(1)$ time. The oracle has size $O(n\log n ((\log n)/\epsilon+f(\epsilon)))$ and pre-processing time $...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کامل